Classification of functions with trivial solutions under t-equivalence
نویسندگان
چکیده
منابع مشابه
Existence of non-trivial solutions for fractional Schrödinger-Poisson systems with subcritical growth
In this paper, we are concerned with the following fractional Schrödinger-Poisson system: (−∆s)u + u + λφu = µf(u) +|u|p−2|u|, x ∈R3 (−∆t)φ = u2, x ∈R3 where λ,µ are two parameters, s,t ∈ (0,1] ,2t + 4s > 3 ,1 < p ≤ 2∗ s and f : R → R is continuous function. Using some critical point theorems and truncation technique, we obtain the existence and multiplicity of non-trivial solutions with ...
متن کاملThe number of classes of choice functions under permutation equivalence
A choice function f of an n-set X is a function whose domain is the power set P(X), and whose range is X, such that f(A) E A for each A ~ X. If k is a fixed positive integer, k :::; n, by a k-restricted choice function we mean the restriction of some choice function to the collection of k-subsets of X. The symmetric group Sx acts, by natural extension on the respective collections C(X) of choic...
متن کاملClassification of Arbitrary Multipartite Entangled States under Local Unitary Equivalence
We propose a practical method for finding the canonical forms of arbitrary dimensional multipartite entangled states, either pure or mixed. By extending the technique developed in one of our recent works, the canonical forms for the mixed N -partite entangled states are constructed where they have inherited local unitary symmetries from their corresponding N + 1 pure state counterparts. A syste...
متن کاملEquivalence of Classification and Regression Under Support Vector Machine Theory
A novel classification method based on regression is proposed in this paper and then the equivalences of the classification and regression are demonstrated by using numerical experiments under the framework of support vector machine. The proposed algorithm implements the classification tasks by the way used in regression problems. It is more efficiently for multi-classification problems since i...
متن کاملGenerating functions for Wilf equivalence under generalized factor order
Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set (P,≤P) by setting u ≤P w if there is a subword v of w of the same length as u such that the i-th character of v is greater than or equal to the i-th character of u for all i. This subword v is called an embedding of u into w. Generalized factor order is related t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Nonlinear Sciences and Applications
سال: 2017
ISSN: 2008-1898,2008-1901
DOI: 10.22436/jnsa.010.07.18